New online algorithm for dynamic speed scaling with sleep state

In this paper, we consider an energy-efficient scheduling problem where n jobs J1, J2, . . . , Jn need to be executed such that the total energy usage of these jobs is minimized while ensuring that each job is finished within it’s deadline. We work in an online setting where a job is known only at it’s arrival time, along with it’s processing volume and deadline. In such a setting, the currently best-known algorithm by Han et al. [7] provides a competitive ratio max {4, 2 + αα} of energy usage. In this paper, we present a new online algorithm SqOA which provides a competitive ratio max {4, 2 + (2 − 1/α)2} of energy usage. For α ≥ 3, the competitive ratio of our algorithm is better than that of any other existing algorithms for this problem.